Interpreting a Finitary Pi-calculus in Differential Interaction Nets
نویسندگان
چکیده
منابع مشابه
Acyclic Solos and Differential Interaction Nets
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding of the pi-calculus. In particular, the induced solo diagrams bear an acyclicity property that induces a faithful encoding into differential intera...
متن کاملEmbedding the Finitary Pi-Calculus in Differential Interaction Nets
We propose a translation of a finitary (that is, replicationfree) version of the monadic localised pi-calculus into the purely exponential part of promotion-free differential interaction nets. This embedding is a simulation of reduction. Since the introduction of Linear Logic by Girard in 1986, it was clear to many logicians and computer scientists that some deep connection between this new log...
متن کاملOn differential interaction nets and the pi-calculus
We propose a translation of a finitary (that is, replication-free) version of the pi-calculus into promotionfree differential interaction net structures, a linear logic version of the differential lambda-calculus (or, more precisely, of a resource lambda-calculus). For the sake of simplicity only, we restrict our attention to a monadic version of the pi-calculus, so that the differential intera...
متن کاملVisible acyclic differential nets, Part I: Semantics
We give a geometric condition that characterizes the differential nets having a finitary interpretation in finiteness spaces: visible acyclicity. This is based on visible paths, an extension to differential nets of a class of paths we introduced in the framework of linear logic nets. The characterization is then carried out as follows: the differential nets having no visible cycles are exactly ...
متن کاملDifferential Linear Logic and Processes
Corresponding reduction (cut-elimination) rules are added, which express operationally this new !/? symmetry. These reduction rules are semantically justified, when interpreting the new logical rules for “!” as standard operations on functions (in particular, codereliction corresponds to differentiation of a function at point 0 of a vector space). This extended linear logic is called Differenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 208 شماره
صفحات -
تاریخ انتشار 2007